V Olume 16 , N Umber 1 F All 2012 N Ote S Ection 101 and C Omputer - I Mplemented I Nventions
نویسنده
چکیده
The law surrounding the patentability of computer-implemented inventions is extraordinarily unclear. Thankfully, the Federal Circuit has granted rehearing en banc to CLS Bank v. Alice to determine the test for computer-implemented inventions under § 101. This Note identifies three current approaches in Federal Circuit doctrine, and finds each lacking. In their place, this Note proposes and defends the data manipulation test, which would hold that a claim is not directed to an abstract idea if it contains a computer element such that: (1) the computer manipulates data, rather than merely being present, (2) the data being manipulated is inherent to the computer, and (3) the data manipulation is directed to one or more particular applications. As this Note argues, the data manipulation test is an easily administrable compromise test that the Federal Circuit, or the Supreme Court upon review, can adopt in CLS Bank. INTRODUCTION....................................................................................................... 162 I. RECENT CASE LAW ON COMPUTER-IMPLEMENTED INVENTIONS ...................... 163 A. Bilski v. Kappos ......................................................................................... 164 B. The “Manifestly Abstract” Test ................................................................. 165 C. The Scope Test ............................................................................................ 168 * J.D. Stanford Law School, 2013. The author is deeply grateful to Professor Mark Lemley for his invaluable commentary on earlier drafts, as well as to countless others for stimulating conversations and criticism. 162 STANFORD TECHNOLOGY LAW REVIEW Vol. 16:1 D. The “Integral” Test .................................................................................... 172 E. Summary ..................................................................................................... 173 II. CURRENT APPROACHES IN THE LITERATURE TO ABSTRACT IDEAS .................. 174 III. A TEST FOR COMPUTER-IMPLEMENTED INVENTIONS ........................................ 177 A. Applying the Data Manipulation Test: Some Examples ............................. 178 1. Inventions Not Manipulating Data ...................................................... 178 2. Inventions Not Involving Data Inherent to the Computer ................... 178 3. Inventions Not Directed to a Particular Application .......................... 179 a. In re Abele ..................................................................................... 179 b. Linked List ..................................................................................... 180 4. Inventions Passing the Data Manipulation Test ................................. 181 5. New Computer Systems Distinguished From ComputerImplemented Inventions....................................................................... 181 B. Advantages of the Data Manipulation Test ................................................ 183 1. Simple to Administer ........................................................................... 183 2. Difficult to Draft Around ..................................................................... 184 3. Fosters Good Policy ............................................................................ 185 4. Drawn from Current Precedent .......................................................... 186 CONCLUSION .......................................................................................................... 187
منابع مشابه
σ-sporadic prime ideals and superficial elements
Let $A$ be a Noetherian ring, $I$ be an ideal of $A$ and $sigma$ be a semi-prime operation, different from the identity map on the set of all ideals of $A$. Results of Essan proved that the sets of associated prime ideals of $sigma(I^n)$, which denoted by $Ass(A/sigma(I^n))$, stabilize to $A_{sigma}(I)$. We give some properties of the sets $S^{sigma}_{n}(I)=Ass(A/sigma(I^n))setminus A_{sigma}(I...
متن کاملAmitraz Poisoning; A case study
A m i t r a z, a n i ns e c t i c i d e /a ca ri c i de of the f o r m a m i d i n e p e st i c i d e s group, is a ? 2 a d r e n e r g i c ag on i st a nd of t he a m i d i ne c h e m i ca l f a m il y generally us e d to c o n t r ol animal e c top a r a s i t e s. Poisoning due to am i t r a z i s r a r e and character...
متن کاملNew methods for constructing shellable simplicial complexes
A clutter $mathcal{C}$ with vertex set $[n]$ is an antichain of subsets of $[n]$, called circuits, covering all vertices. The clutter is $d$-uniform if all of its circuits have the same cardinality $d$. If $mathbb{K}$ is a field, then there is a one-to-one correspondence between clutters on $V$ and square-free monomial ideals in $mathbb{K}[x_1,ldots,x_n]$ as follows: To each clutter $mathcal{C}...
متن کاملLie $^*$-double derivations on Lie $C^*$-algebras
A unital $C^*$ -- algebra $mathcal A,$ endowed withthe Lie product $[x,y]=xy- yx$ on $mathcal A,$ is called a Lie$C^*$ -- algebra. Let $mathcal A$ be a Lie $C^*$ -- algebra and$g,h:mathcal A to mathcal A$ be $Bbb C$ -- linear mappings. A$Bbb C$ -- linear mapping $f:mathcal A to mathcal A$ is calleda Lie $(g,h)$ -- double derivation if$f([a,b])=[f(a),b]+[a,f(b)]+[g(a),h(b)]+[h(a),g(b)]$ for all ...
متن کاملOn vertex balance index set of some graphs
Let Z2 = {0, 1} and G = (V ,E) be a graph. A labeling f : V → Z2 induces an edge labeling f* : E →Z2 defined by f*(uv) = f(u).f (v). For i ε Z2 let vf (i) = v(i) = card{v ε V : f(v) = i} and ef (i) = e(i) = {e ε E : f*(e) = i}. A labeling f is said to be Vertex-friendly if | v(0) − v(1) |≤ 1. The vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. In this paper ...
متن کامل